Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability
نویسنده
چکیده
منابع مشابه
Simplifying Neural Nets by Discovering Flat Minima
We present a new algorithm for finding low complexity networks with high generalization capability. The algorithm searches for large connected regions of so-called ''fiat'' minima of the error function. In the weight-space environment of a "flat" minimum, the error remains approximately constant. Using an MDL-based argument, flat minima can be shown to correspond to low expected overfitting. Al...
متن کاملA Generalization of Initial Conditions in Benchmarking of Economic Time-Series by Additive and Proportional Denton Methods
The paper presents unified analytical solution for combining high-frequency and low-frequency economic time-series by additive and proportional Denton methods with parametrical dependence on the initial values of variable and indicator in evident form. This solution spans Denton’s original and Cholette’s advanced benchmarking initial conditions as the subcases. Computational complexity of the o...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملMultiple Solutions: A Key to Strengthening the Generalization Skill in Mathematic-Like Thinking
Multiple Solutions: A Key to Strengthening the Generalization Skill in Mathematic-Like Thinking Z. Rahimi* E. Talaa'ee, Ph.D.** E. Reyhaani, Ph.D.*** H. Fardaanesh, Ph.D.**** Emphasizing multiple solutions can help with the strengthening of the generalization skill. To test this hypothesis, a group of high school students in math and experimental sciences was selected in or...
متن کاملKolmogorov Complexity, Causality And Spin
A novel topological and computational method for ‘motion’ is described. Motion is constrained by inequalities in terms of Kolmogorov Complexity. Causality is obtained as the output of a high-pass filter, passing through only high values of Kolmogorov Complexity. Motion under the electromagnetic field described with immediate relationship with G2 Holonomy group and its corresponding dense free 2...
متن کامل